منابع مشابه
ON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS
The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...
متن کاملReturn maps of folded nodes and folded saddle-nodes.
Folded nodes occur in generic slow-fast dynamical systems with two slow variables. Open regions of initial conditions flow into a folded node in an open set of such systems, so folded nodes are an important feature of generic slow-fast systems. Twisting and linking of trajectories in the vicinity of a folded node have been studied previously, but their consequences for global dynamical behavior...
متن کاملThe topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملon degrees of end nodes and cut nodes in fuzzy graphs
the notion of strong arcs in a fuzzy graph was introduced bybhutani and rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. in mordeson and yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.in this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...
متن کاملParsing and Empty Nodes
This paper describes a method for ensuring the termination of parsers using grammars that freely posit empty nodes. The basic idea is that each empty no& must be associated with a lexical item appearing in the input string, called its sponsor. A lexical item, as well as labeling the no&for the corresponding word, provides labels for a fixed number, possibly zero, of empty nodes. The number of n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of the Rheumatic Diseases
سال: 1999
ISSN: 0003-4967
DOI: 10.1136/ard.58.11.675